Covering n-Permutations with (n+1)-Permutations
نویسندگان
چکیده
منابع مشابه
Covering n-Permutations with (n+1)-Permutations
Let Sn be the set of all permutations on [n] := {1, 2, . . . , n}. We denote by κn the smallest cardinality of a subset A of Sn+1 that “covers” Sn, in the sense that each π ∈ Sn may be found as an order-isomorphic subsequence of some π′ in A. What are general upper bounds on κn? If we randomly select νn elements of Sn+1, when does the probability that they cover Sn transition from 0 to 1? Can w...
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملCovering radius for sets of permutations
We study the covering radius of sets of permutations with respect to the Hamming distance. Let f(n, s) be the smallest number m for which there is a set of m permutations in Sn with covering radius r ≤ n − s. We study f(n, s) in the general case and also in the case when the set of permutations forms a group. We find f(n, 1) exactly and bounds on f(n, s) for s > 1. For s = 2 our bounds are line...
متن کاملA Stream Cipher Based on Chaotic Permutations
In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...
متن کاملIntersecting families of permutations and partial permutations
The above result motivated the study of intersecting families of permutations which was initiated by Deza and Frankl, see [2]. Let Sn be the symmetric group on [n], that is the group of all permutations of [n]. For a positive integer t, a subset A of Sn is said to be t-intersecting if, for any g, h ∈ A with g 6= h, we have |{x : g(x) = h(x)}| ≥ t. By an intersecting family, we mean an 1-interse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/2168